Method for determining a queue identification number and for determining the length of the queue

ABSTRACT

The method is for determining a value characterizing blocking at an operating station for dispatching individual units, where the station operates in a stop-go mode whereby unit movement is stopped or units are allowed through. The values is determined used a detector for measuring the filling time between the beginning of a block or stop phase and the continuous loading of the detector and comparison with a reference filling time. The characteristic value is set at one value when the reference filling time is exceeded and another otherwise. &lt;??&gt;Independent claims are also made for methods for determining the filling time requirement and the backwash length.

[0001] The present invention relates to a method of determining a tailback characteristic factor δ and self-calibrating methods resulting therefrom for estimating tailback lengths at operating stations for processing individually moving units, such as, for example, traffic-light installations or filters, having a detector situated upstream. The parameters thus determined and the characteristic values derived therefrom may be used to control the traffic-light installation or filters or used to display the traffic status in primary devices.

PRIOR ART

[0002] An important matter in road-traffic technology is the determination of tailback lengths at traffic-light installations in order to obtain information items relating to the traffic flow. The knowledge of the tailback lengths may, in addition, serve to control the signal installations (Bernhard Friedrich, Methoden und Potentiale adaptiver Verfahren für die Lichtsignalsteuerung (Methods and potentials of adaptive methods for traffic-signal control), Straβenverkehrstechnik 9/1996). According to Joos Bernhard, Thomas Riedel, Erkennung von Stau mit kurzen Schleifendetektoren (Detection of tailback using short loop detectors), Straβenverkehrstechnik 7/1999, tailbacks at traffic-light installations can be detected or calculated only between a stop line and detector. The same applies also to tailbacks at any operating stations for processing individually moving units having alternating hold-back and release phases.

[0003] A substantial disadvantage of this known method consists in not being able to determine tailback lengths that are greater than the distance between an operating station and detector.

[0004] The object of the invention is therefore to provide a method with which a determination of the tailback length at operating stations for processing individually moving units is made possible not only between an operating station and detector in order to control a traffic-light installation or filter with the aid of said tailback length or characteristic values derived therefrom, such as, for example, waiting times, or to display traffic statuses in primary devices.

DESCRIPTION OF THE INVENTION

[0005] This object is achieved by a method of determining a tailback characteristic factor δ in accordance with claim 1, with which the tailback length can be determined in a simple way. In addition, other relevant parameters for the installation control, such as, for example, the saturation time requirement, can also be determined using said tailback characteristic factor. Methods of determining the tailback length using the tailback characteristic factor are the subject matter of claims 4 and 16.

[0006] In particular, the present invention provides a method of determining a tailback characteristic factor δ at operating stations for processing individually moving units, each processing phase comprising a hold-back phase and a release phase and a detector being situated upstream of the operating station, by measuring the time (filling time) between the hold-back start or a time instant tied to the hold-back start and continuous occupancy of the detector and subsequent comparison with a reference filling time, wherein a first value is assigned to δ if the reference filling time is exceeded and a second value is otherwise assigned.

[0007] A time instant coupled to a transition time before the start of the hold-back phase may also be chosen, for example, as the start of the filling time in addition to the hold-back start. In the case of traffic lights, the amber phase would be suitable as transition time.

[0008] If the reference filling time is dropped below, that is to say if the distance between an operating station and detector is filled more rapidly than in the reference time, a tailback may be assumed. Otherwise, the units are in free flow.

[0009] In this connection, the reference filling time is obtained, for example, from simulator tests or empirical investigations. Advantageously, the reference filling time is chosen as a function of the geometry of the inflow region, for example of the distance between a detector and a filling station, the lane width, etc., and/or of the release time of the operating station.

[0010] Using the tailback characteristic factor δ determined in the way described above, a multiplicity of relevant parameters for optimizing throughput or a traffic status display can be determined.

[0011] A first method of estimating tailback length {circumflex over (L)}_(n) using the tailback characteristic factor determined according to the invention in the n^(th) processing phase is based on the assumption that, as a linear function of a smoothed tailback characteristic factor {circumflex over (δ)}_(n) that is determined from the tailback characteristic factor δ_(n) taking into account the (n−1)^(th) smoothed tailback characteristic factor {circumflex over (δ)}_(n−1), {circumflex over (L)}_(n) is given by:

{circumflex over (L)} _(n)({circumflex over (δ)}_(n))=m{circumflex over (δ)} _(n),  (1)

[0012] where {circumflex over (δ)}_(n) may no longer assume only two values, but a plurality of values. With a Specified m, the tailback length for a given {circumflex over (δ)}_(n) is given by equation (1). The tailback characteristic factor is smoothed in order to avoid excessively large changes in the tailback characteristic factor from one processing phase to the next.

[0013] This method is distinguished by the fact that speed measurements are not necessary to determine the tailback length.

[0014] Advantageously, the slope is readjusted in each n^(th) processing phase. For this purpose, the traffic level q_(n) is determined. This is given, for example, by an estimate or by the measured number of units that pass the detector during the n^(th) processing phase. It can be calculated from the traffic level how many units were present during the n^(th) hold-back phase at least upstream of the operating station; a lower limit L_(n) ⁰ is consequently obtained for the tailback length. On the other hand, the tailback-length function of the previous processing step {circumflex over (L)}_(n−1)({circumflex over (δ)}_(m))=m_(n−1){circumflex over (δ)}_(n) with {circumflex over (δ)}_(n) and a suitably chosen m_(n−1) yields an estimate of the actual tailback length in the current processing phase. By comparing L_(n) ⁰ and {circumflex over (L)}_(n−1)({circumflex over (δ)}_(n)), and, consequently, {circumflex over (L)}_(n) can be calibrated.

[0015] The slope of the (n−1)^(th) processing phase is advantageously obtained by recursive application of the method just described with suitable starting values for {circumflex over (δ)}₀ and m₀. This method is consequently self-calibrating.

[0016] Preferably, the tailback characteristic factor is smoothed by forming a convex combination of the current tailback characteristic factor and the smoothed tailback characteristic factor of the previous processing:

{circumflex over (δ)}_(n)=αδ_(n)+(1−α) {circumflex over (δ)}_(n−1), α∈[0,1]  (2)

[0017] The traffic level q_(n) is preferably measured using the detector located upstream of the operating station.

[0018] In an advantageous version, the lower limit of the tailback length L_(n) ⁰ is given as a linear function of q_(n) since even this simple form is a good approximation. Preferably, the slope of this straight line depends on the time in which the detector is continuously occupied during a portion of the processing phase. If this dependence is taken into account, the agreement with real data is improved.

[0019] It is advantageous to alter the slope m_(n) only if either δ_(n) has assumed the second value and L_(n) ⁰>{circumflex over (L)}_(n−1)({circumflex over (δ)}_(n))=m_(n−1){circumflex over (δ)}_(n) or if δ_(n) has assumed the first value and L_(n) ⁰<{circumflex over (L)}_(n−1)({circumflex over (δ)}_(n))=m_(n−1){circumflex over (δ)}_(n). In the first case, δ_(n) shows, on the one hand, a tailback at a distance of at least L_(n) ⁰ from the operating station and, on the other hand, the estimate of the tailback length {circumflex over (L)}_(n−1)({circumflex over (δ)}_(n)) is below L_(n) ⁰. In the second case, although δ_(n) does not indicate a tailback of length L_(n) ⁰, the tailback is, on the other hand, still longer than L_(n) ⁰ according to the estimate {circumflex over (L)}_(n−1)({circumflex over (δ)}_(n)). In both cases, therefore, it is appropriate to calibrate the slope m_(n). If, on the other hand, the value of the tailback characteristic factor and the estimated tailback length are not inconsistent, the slope is retained: m_(n)=m_(n−1).

[0020] To adapt the slope m_(n), a smoothed tailback. length L′_(n) may be used that results as a combination of L_(n) ⁰ and {circumflex over (L)}_(n−1)({circumflex over (δ)}_(n)):

L _(n) ′−βL _(n) ⁰ (q _(n))+(1−β){circumflex over (L)} _(n−1)({circumflex over (δ)}_(n)), β>0  (3)

[0021] The tailback characteristic factor δ determined by the method according to the invention described above may also be used to determine the saturation time requirement; this is the average time requirement value of a unit in saturated (no longer free) flow during the release phase. The saturation time requirement is, on the one hand, a measure of the performance of the operating station. On the other hand, it may also serve to estimate tailback length by means of a queuing model.

[0022] To determine the saturation time requirement t_(n) ^(B) in the n^(th) processing step, the tailback characteristic feature δ is first determined using the method according to the invention and the traffic level q_(n) is measured or estimated. The saturation time requirement can then be calculated, using a suitable starting condition for t₀ ^(B), by means of $\begin{matrix} {t_{n}^{B} = \left\{ \begin{matrix} {\frac{t_{n}^{q}}{q_{n}},} & {{{{{if}\quad \delta_{n}} = {\delta_{n - 1}\quad {is}\quad {equal}\quad {to}\quad {the}\quad {second}\quad {value}}},}} \\ {t_{n - 1}^{B},} & {{{otherwise}.}} \end{matrix} \right.} & (4) \end{matrix}$

[0023] where t^(g) _(n) is the release time in the n^(th) processing step.

[0024] In order to avoid excessively large changes in the saturation time requirement from one processing step to the next, only a specified maximum change Δt^(B) _(max)>0 of the saturation time requirement is preferably permitted in each step. If, therefore, the t_(n) ^(B) obtained from equation (4) fulfils one of the inequalities:

Δt ^(B) −t ^(B) _(n) −t ^(B) _(n−1) >Δt ^(B) _(max) or Δt ^(B) <−Δt ^(B) _(max)  (5)

[0025] a modified saturation time requirement {circumflex over (t)}^(B) _(n) is advantageously calculated, where

{circumflex over (t)} ^(B) _(n) =t ^(B) _(n−1) +Δt ^(B) _(max) or {circumflex over (t)} ^(B) _(n) =t ^(B) _(n−1) −Δt ^(B) _(max)  (6)

[0026] It is advantageous to measure the traffic level q_(n) using the detector situated upstream of the operating station.

[0027] As an alternative to the method according to the invention described above, the tailback length can be determined with the aid of a queuing model that comprises an inherent model saturation time requirement τ^(B) _(n) having a suitably chosen start value as parameter to be calibrated. Such a method may comprise in any nth processing operation:

[0028] Next, the actual saturation time requirement t^(B) _(n) is determined in accordance with the method according to the invention described above. If the saturation requirement value of the last processing phase changes by Δt^(B), the inherent model saturation requirement valuo τ^(B) _(n) is adapted using

τ^(B) _(n)=τ^(B) _(n−1) +c _(d) Δt ^(B)  (7)

[0029] where C_(d) denotes a suitably chosen damping constant. In particular, the inherent model saturation requirement value is adapted using

τ^(B) _(n)=τ^(B) _(n−1) +c _(d) sgn(Δt ^(B))min{|Δt ^(B) |, Δt ^(B) _(max)}  (8)

[0030] if only a maximum change of Δt^(B) _(max) is permitted for the actual saturation requirement value, where sgn(Δt^(B)) denotes the sign of Δt^(B). A lower limit for the tailback length L⁰ _(n) is calculated from the traffic level. Using these quantities, a first estimate of the tailback length L″_(n) is calculated with the aid of a queuing model. Then L″_(n) and L⁰ _(n) are compared in a way analogous to the above method of tailback length estimation. If L″_(n)>L⁰ _(n) and δ_(n) has assumed the first value or if L″_(n)<L⁰ _(n) and δ_(n) has assumed the second value, the inherent model saturation time requirement has to be modified. Using the calibrated model saturation time requirement, a calibrated estimate of the tailback length is then calculated using the tailback model.

[0031] This method is distinguished in that no speed measurements are necessary for determining the tailback length.

[0032] Furthermore, faults in the outflow can advantageously be taken into account and a suitably modified traffic level used in the queuing model.

[0033] In a beneficial version of the fault compensation, q_(n) is modified only if it is less than the second-largest value max_(10.2) (q) of the last ten q values. In this case, a time interval during the processing phase is chosen to calculate the fault compensation and predetermined, shorter time intervals, for example the full seconds in which the detector is continuously occupied in the total interval, are counted. The entire interval preferably begins a few seconds after the start of the release phase and finishes a few seconds after the end of the release phase. If the number thus obtained is divided by the length of the entire interval, the degree of occupancy b ∈ [0,1] of the detector is obtained. If b drops below a lower limit u, the value 0 is assigned to a fault characteristic factor s. If b exceeds an upper limit o, the value 1 is assigned to s. If u<b<o, s is given by $\begin{matrix} {s = \frac{b - u}{o - u}} & (9) \end{matrix}$

[0034] As a modified traffic level q′n

q′ _(n) =q+s(1+P _(comp))(max_(10.2)(q)−q)  (10)

[0035] is then taken, where P_(comp) is a constant with which the level of the fault compensation can be adjusted.

[0036] The inherent model saturation time requirement is advantageously calibrated using a feedback method based on a conventional PID regulator (proportional-integral-differential regulator). For this purpose, −1 should be assigned to δ_(n) as the first value (if there is no tailback) and 1 should be assigned as the second value (if there is a tailback). The calibration uses two variables: {tilde over (S)}_(n) (corresponds to a sawtooth integrating term) and {tilde over (d)}_(n) (corresponds to a differentiating member). If δ_(n)L″_(n)≧δ_(n)L⁰ _(n), {tilde over (S)}_(n)={tilde over (d)}_(n)=0 and the saturation time requirement is unaltered. Otherwise, the auxiliary variable $\begin{matrix} {A = {\frac{t_{n}^{B}}{t_{n}^{g}}\left( {L_{n}^{''} - L_{n}^{0}} \right)}} & (11) \end{matrix}$

[0037] is defined.

[0038] In order to avoid overcorrecting the saturation time requirement,

A′=sgn(A)min{|A|, 1}  (12)

[0039] can be defined, where sgn(A) denotes the sign of A. There are now chosen $\begin{matrix} {{\overset{\sim}{s}}_{n} = \left\{ {\begin{matrix} {{{\overset{\sim}{s}}_{n - 1} - \delta_{n}},} & {{{if}\quad {\overset{\sim}{s}}_{n - 1}\delta_{n}} < 0} \\ {{- \delta_{n}},} & {{otherwise}\quad} \end{matrix}{and}} \right.} & (13) \\ {{\overset{\sim}{d}}_{n} = \left\{ \begin{matrix} {\frac{{\overset{\sim}{d}}_{n - 1}}{t_{d}},} & {{{if}\quad {\overset{\sim}{d}}_{n - 1}\delta_{n}} < 0} \\ {{- \delta_{n}},} & {{otherwise}\quad} \end{matrix} \right.} & (14) \end{matrix}$

[0040] where t_(d) is a constant to be suitably chosen. This then yields the calibrated saturation time requirement for the queuing model

{tilde over (τ)}^(B) _(n)=τ^(B) _(n)−(p _(p) A′+|A′|(p _(i) {tilde over (S)} _(n) +p _(d) {tilde over (d)} _(n)))  (15)

[0041] where p_(p), p_(i) and p_(d) denote the parameters of the regulator.

[0042] It is advantageous to smooth the calculated tailback length by forming a convex combination of L⁰ _(n) and L″_(n):

L _(n) =γL ⁰ _(n)+(1−γ)L″ _(n), γ∈[0,1].  (16)

[0043] This avoids an overcorrection of the tailback length.

[0044] Two methods according to the invention of determining the tailback length estimation with the aid of the method according to the invention of determining the tailback characteristic factor are described below with reference to the drawing. In the drawing:

[0045]FIG. 1 shows the calculated slope m_(n) of the tailback-length function as a function of time from method 1,

[0046]FIG. 2 shows the estimated tailback (in vehicles) as a function of the explicitly measured, smoothed tailback from method 1,

[0047]FIG. 3 shows the estimate of the tailback time requirement t^(B) _(n) as a function of time from method 2.

[0048] Method 1

[0049] The application of the method of tailback length estimation and its verification is shown at an approach to a heavily loaded traffic-light installation (in the town direction of the Landsberger/Trappentreustrasse, Munich) with strongly varying green times (release times).

[0050] The detector is located 30 m or approximately 5 vehicles away from the stop line. As a reference filling time for this distance, 22 seconds is assumed.

[0051] If the reference filling time is exceeded, the value 0 is assigned to δ and otherwise, the value 1 is assigned. The tailback characteristic factor is smoothed in that {circumflex over (δ)}_(n)=αδ_(n)+(1−α){circumflex over (δ)}_(n−1), where α is typically between 0.05 and 0.2 and δ₀={circumflex over (δ)}₀=0.

[0052] The lower limit is calculated by means of

L ⁰ _(n) =q _(n) {square root}{square root over (1−min(γ₁ , bγ ₂))}+α ₁γ_(i)≧0,  (17)

[0053] where α₁ takes account of the vehicles between the detector and stop line and therefore assumes the value α₁=5. In this exemplary embodiment, γ₁ is chosen as =0.9 and γ_(z) is chosen as =1.2. The degree of occupancy b of the detector is obtained by counting the full seconds between 5 s after the start of release and 15 s after the end of release in which the detector is continuously occupied, and then dividing by the total length of this time interval; consequently, b is always ε[0,1].

[0054] The slope m_(n) is written as m_(n)=m′_(n)/m″_(n) in this example, where m′₀=10 and m″₀=0.5 form suitable start values. The slope is modified by means of a smoothed value

[0055] L′_(n)=βL⁰ _(n)(q_(n))+(1β){circumflex over (L)}_(n−1)({circumflex over (δ)}_(n)), where β=0.7. It is the case that $\begin{matrix} {m_{n}^{\prime} = \left\{ {\begin{matrix} {\frac{{\left( {k_{n - 1} - 1} \right)m_{n - 1}^{\prime}} + {{\hat{\delta}}_{n}L_{n}^{\prime}}}{k_{n - 1}},} & {{{if}\quad {the}\quad {values}\quad {of}\quad \delta \quad {and}\quad L_{n}^{0}\quad {are}\quad {inconsistent}}} \\ {m_{n - 1}^{\prime},} & {{{otherwise},}} \end{matrix}{and}} \right.} & (18) \\ {m_{n}^{''} = \left\{ {\begin{matrix} {\frac{{\left( {k_{n - 1} - 1} \right)m_{n - 1}^{''}} + {\hat{\delta}}_{n}^{2}}{k_{n - 1}},} & {{{if}\quad {the}\quad {values}\quad {of}\quad \delta \quad {and}\quad L_{n}^{0}\quad {are}\quad {inconsistent}}} \\ {m_{n - 1}^{''},} & {{{otherwise},}} \end{matrix}{where}} \right.} & (19) \\ {k_{n} = \left\{ \begin{matrix} {{\min \left\{ {{k_{n - 1} + 1},K} \right\}},} & {{{if}\quad {the}\quad {values}\quad {of}\quad \delta \quad {and}\quad L_{n}^{0}\quad {are}\quad {inconsistent}}} \\ {k_{n - 1},} & {{{otherwise},}} \end{matrix} \right.} & (20) \end{matrix}$

[0056] Suitable values for a fast, but stable estimate are k₀=10 and K=1000.

[0057]FIG. 1 shows the calibration of the slope m_(n). The arbitrarily specified value of approximately 20 increases on the first day to tho value that corresponds to the traffic characteristic of the lane. Only slight adaptation processes then occur. The control behaviour is stable and robust.

[0058]FIG. 2 shows the comparison of the estimated, smoothed tailback length with manually increased, slightly smoothed tailback length values. The measured tailback L^(real) _(n) was smoothed using

{circumflex over (L)} ^(real) _(n)=0.3L ^(real) _(n)+0.7{circumflex over (L)} ^(real) _(n−1)  (21)

[0059] A squared correlation coefficient of R²=0.7748 indicates a good relationship between estimated and real tailback length.

[0060] Method 2

[0061] As an application of the method, the determination of the tailback length at the approach mentioned in the above example to a traffic-light installation is described with the aid of a queuing model.

[0062] To calculate the saturation time requirement, a maximum change of Δt^(B) _(max)=0.02 is permitted. The change is additionally damped in the queuing model by the factor c_(d)=0.9.

[0063]FIG. 3 shows the determination of the time requirement value t^(B) _(n) as a function of time for a start value of t^(B) ₀=2s. It can be seen that, in addition to the transient oscillation process, fluctuations occur in t^(B) _(n) several times within the two working days. These fluctuations are explained, inter alia, by variable traffic patterns and driving behaviour of road users that is dependent on the time of day.

[0064] Faults in the outflow are compensated by means of the degree of occupancy known from the above example. The fault characteristic factor s is given by equation (9), where u=0.2 and o=1.1 are used for the limits. This choice guarantees that s is always less than 1.

[0065] In this example, the macroscopic queuing model is taken from R. M. Kimber and E. M. Hollis, Traffic queues and delays at road junctions, TRRL Laboratory Report 909, Berkshire, 1979. The model equation for the tailback length L is $\begin{matrix} {{L = {\frac{1}{2}\left( {\sqrt{A^{2} + B} - A} \right)}}{where}} & (22) \\ {{A = \frac{\begin{matrix} {{\left( {1 + {q\frac{\tau^{B}}{t_{n}^{g}}}} \right)\left( \frac{t_{n}^{g}}{\tau^{B}} \right)^{2}} +} \\ {{\left( {1 - L_{n - 1}} \right)\frac{t_{n}^{g}}{\tau^{B}}} - {2\left( {1 - C} \right)\left( {L_{n - 1} + q} \right)}} \end{matrix}}{\frac{t_{n}^{g}}{\tau^{B}} + \left( {1 - C} \right)}}{and}} & (23) \\ {B = \frac{4\left( {L_{n - 1} + q} \right)\left( {\frac{t_{n}^{g}}{t^{B}} - {\left( {1 - C} \right)\left( {L_{n - 1} + q} \right)}} \right)}{\frac{t_{n}^{g}}{\tau^{B}} + \left( {1 - C} \right)}} & (24) \end{matrix}$

[0066] where C=0.6 characterizes the statistical fluctuations in the outflow.

[0067] Suitable parameters for calibrating the saturation time requirement analogously to a PID controller are p_(d)=0.003, p_(i)=0.01, p_(d)=0.01 and t_(d)=1.2.

[0068] The tailback-length estimate is smoothed using γ=0.6. 

1. Method of determining a tailback characteristic factor δ at operating stations for processing individually moving units having alternating hold-back and release phases and having a detector upstream of the respective operating station by measuring the filling time between the hold-back start or a time instant tied to the hold-back start and continuous occupancy of the detector and subsequent comparison with a reference filling time, in which method a first value is assigned to the tailback characteristic factor δ if the reference filling time is exceeded and a second value is assigned if the reference filling time is not exceeded.
 2. Method according to claim 1, in which the reference filling time is chosen as a function of the geometry of the inflow region of the operating station.
 3. Method according to claim 1, in which the reference filling time is chosen as a function of the release time.
 4. Method of determining the tailback length {circumflex over (L)}_(n) in the nth processing phase by (a) determining the nth tailback characteristic factor δ_(n) according to claim 1, (b) calculating a smoothed tailback characteristic factor {circumflex over (δ)}_(n), using the (n−1)^(th) smoothed tailback characteristic factor {circumflex over (δ)}_(n−1), (c) determining the tailback length {circumflex over (L)}_(n) ({circumflex over (δ)}_(n))=m{circumflex over (δ)}_(n) with suitably predetermined slope m.
 5. Method according to claim 4, wherein the slope m_(n) is determined in the nth processing phase by (a) determining the traffic level q_(n), (b) calculating a lower limit L_(n) ⁰ for the tailback length as a function of q_(n), (c) determining the slope m_(n) by comparison of L_(n) ⁰ with {circumflex over (L)}_(n−1) ({circumflex over (δ)}_(n)) with a suitably predetermined slope m_(n−1).
 6. Method according to claim 5, in which the slope m_(n−1) is determined by recursive application of the method according to claim 5 with suitable starting conditions for m₀ and {circumflex over (δ)}₀.
 7. Method according to claim 4, in which the smoothed tailback characteristic factor {circumflex over (δ)}_(n) is calculated as a convex combination of δ_(n) and {circumflex over (δ)}_(n−1) in accordance with {circumflex over (δ)}_(n)=αδ_(n)+(1−α) {circumflex over (δ)}_(n−1), α∈[0,1].
 8. Method according to claim 5, in which the traffic level q_(n) is measured with a detector situated upstream of the operating station.
 9. Method according to claim 5, in which the lower limit L_(n) ⁰ of the tailback length is predetermined as a linear function of q_(n).
 10. Method according to claim 9, in which the slope L_(n) ⁰(q_(n)) is predetermined as a function of the time, in which the detector is continuously occupied during a portion of the processing phase.
 11. Method according to claim 5, in which the slope m_(n), is altered with respect to m_(n−1) if the second value is assigned to δ_(n) and L_(n) ⁰>{circumflex over (L)}_(n−1) ({circumflex over (δ)}_(n))=m_(n−1){circumflex over (δ)}_(n) in or if the first value is assigned to δ_(n) and L_(n) ⁰<{circumflex over (L)}_(n−1)({circumflex over (δ)}_(n))=m_(n−1){circumflex over (δ)}_(n) and otherwise m_(n)=m_(n−1) is set.
 12. Method according to claim 5, in which the slope m_(n) is adapted by means of a smoothed value L _(n) ′=βL _(n) ⁰(q _(n))+(1−β) {circumflex over (L)}_(n−1) ({circumflex over (δ)}_(n)) where β>0.
 13. Method of determining the saturation time requirement t_(n) ^(B), which corresponds to the average time requirement of a unit with saturated flow during the release phase, by (a) determining the tailback characteristic factor according to claim 1, (b) determining the traffic level q_(n), (c) determining the saturation time requirement t_(n) ^(B) using the release time t_(n) ^(q) and a suitable starting condition for t₀ ^(B) in accordance with $t_{n}^{B} = \left\{ \begin{matrix} {\frac{t_{n}^{g}}{q_{n}},} & {{{{{if}\quad \delta_{n}} = {\delta_{n - 1}\quad {is}\quad {equal}\quad {to}\quad {the}\quad {second}\quad {value}}},}} \\ {{t_{n - 1}^{B},}\quad} & {{{otherwise}.}} \end{matrix} \right.$


14. Method according to claim 13, in which the saturation time requirement t^(B) _(n) is altered in each nth processing phase by not more than a predetermined maximum value compared with the saturation time requirement of the (n−1)^(th) processing phase.
 15. Method according to claim 13, in which the traffic level q_(n) is measured with the detector upstream of the operating station.
 16. Method of determining the tailback length L″_(n) by (a) determining the saturation time requirement t^(B) _(n) according to claim 13, (b) determining the inherent model saturation time requirement τ^(B) _(n) in accordance with τ_(n) ^(B)=τ^(B) _(n−1)+c_(d)(t^(B) _(n)−t^(B) _(n−1)) using the (n−1)^(th) model saturation time requirement τ^(B) _(n−1) and with a suitably chosen C_(d), (c) calculating a lower limit of the tailback length L_(n) ⁰ as a function of q_(n), (d) calculating a tailback length estimation with a queue model using the inherent model saturation time requirement, (e) calibrating the inherent model saturation requirement by comparing the tailback length estimation with the lower limit L_(n) ⁰, (f) calculating the tailback length L_(n)″ with a queuing model using the calibrated inherent model saturation time requirement.
 17. Method according to claim 16, in which the tailback length calculation is made with a modified traffic level that takes account of faults in the outflow.
 18. Method according to claim 17, in which the flow compensation is calculated by counting in a time interval during the processing phase predetermined time intervals, in particular complete seconds, in which the detector is continuously occupied.
 19. Method according to claim 16, in which the inherent model saturation time requirement is calibrated with a method along the lines of a classic PID controller.
 20. Method according to claim 16, in which the tailback length estimation is smoothed by forming a convex combination of L_(n) ⁰ and L_(n)″ in accordance with L_(n)=γL_(n) ⁰+(1−γ)L_(n)″, γ∈[0,1]. 